Final Project: Conjunctive, Subset, and Range Queries on Encrypted Data

The 2006 paper Conjunctive, Subset, and Range Queries on Encrypted Data by Dan Boneh and Brent Waters addresses the problem of predicate evaluation on encrypted data in the public key setting – one that does not leak any additional information about the data. The authors provide both a security notion for such queries and an efficient construction based on the bilinear and 3-party composite Diffie-Hellman assumptions. The goal of this write-up is to present the security notion devised by Boneh and Waters and describe their construction at a high level.